An invitation to the promise constraint satisfaction problem

The study of the complexity constraint satisfaction problem (CSP), centred around Feder-Vardi Dichotomy Conjecture, has been very prominent in last two decades. After a long concerted effort and many partial results, Conjecture proved 2017 independently by Bulatov Zhuk. At about same time, vast generalisation CSP, called promise started to gain prominence. In this survey, we explain importance CSP highlight new interesting features that brought light. classification quest for is wide open, argue that, despite being more general, rather accessible range researchers than dichotomy-led been.